Linear programming and pediatric dietetics.

The composition of 500 foods has been stored in a computer in order to analyse a child's diet. The methodology of operations research is applied to a very simple problem: a diet with only two foods. The geometrical representation of the 'feasible region' and of the 'objective function' is illustrated. One of the analytical methods employable with many variables (foods) is considered. This method was used in trying to find diets allowing for the preferential use of selected foods while respecting recommended dietary allowances, the tastes of the child and other constraints. The theoretical difficulty of transferring this methodology to pediatric dietetics was examined. We solved a simple case utilizing this procedure.